Sparse Kronecker-Product Coding for Unsourced Multiple Access

Sparse Solutions to Underdetermined Kronecker Product Systems ∗

Three properties of matrices: the spark, the mutual incoherence and the restricted isometry property have recently been introduced in the context of compressed sensing. We study these properties for matrices that are Kronecker products and show how these properties relate to those of the factors. For the mutual incoherence we also discuss results for sums of Kronecker products.

Coding for Multiple Access Communications

An idealized code-division multiple-access (CDMA) system is used as a vehicle to illustrate a new approach to coding for multiple-access channels that aims to achieve reasonable efficiency while avoiding the prohibitive complexity of optimum coding schemes. The new approach combines "partial demodulation" to separate users into roughly independent groups with the creation of "virtual channels" ...

Robust coding for multiple-access channels

Coding for T-user multiple-access channels

Coding schemes for the binary memoryless T-user adder channel are investigated in this paper. Fit upper and lower bounds on the capacity sum, which are asymptotically tight with increasing T, are derived for the noiseless case. Second, a class of T-user mdquely demdable codes with rates, asymptotically in T, equal to the maximal achievable vahes is constructed. A decoding algorithm for these co...

Shifted Kronecker Product Systems

Abstract. A fast method for solving a linear system of the form (A(p) ⊗ · · · ⊗ A(1) − λI)x = b is given where each A(i) is an ni-by-ni matrix. The first step is to convert the problem to triangular form (T (p) ⊗ · · · ⊗ T (1) − λI)y = c by computing the (complex) Schur decompositions of the A(i). This is followed by a recursive back-substitution process that fully exploits the Kronecker struct...